Recoverable Robust Knapsacks: Γ-Scenarios
نویسندگان
چکیده
In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty of the item weights follows the approach of Bertsimas and Sim [3, 4]. In contrast to the robust approach, a limited recovery action is allowed, i.e., upto k items may be removed when the actual weights are known. This problem is motivated by the assignment of traffic nodes to antennas in wireless network planning. Starting from an exponential min-max optimization model, we derive an integer linear programming formulation of quadratic size. In a preliminary computational study, we evaluate the gain of recovery using realistic planning data.
منابع مشابه
Recoverable robust knapsacks: the discrete scenario case
Admission control problems have been studied extensively in the past. In a typical setting, resources like bandwidth have to be distributed to the different customers according to their demands maximizing the profit of the company. Yet, in real-world applications those demands are deviating and in order to satisfy their service requirements often a robust approach is chosen wasting benefits for...
متن کاملSynthesis of densely functionalized chromenes using a magnetic recoverable ionic liquid as the catalyst
In the present study, robust, versatile and straightforward strategy for the diversity-oriented convergent synthesis of a vast range of highly functionalized and biologically effective chromenes is introduced with the reaction of malononitrile, dimedone/cyclohexadione/4-hydroxycoumarin and benzaldehydes in the presence of [γ-Fe2O3@HAp-Si(CH2)3BF4@DMIM] as the catalyst. The structures of all the...
متن کاملThe Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
We present a new concept for optimization under uncertainty: recoverable robustness. A solution is recovery robust if it can be recovered by limited means in all likely scenarios. Specializing the general concept to linear programming we can show that recoverable robustness combines the flexibility of stochastic programming with the tractability and performances guarantee of the classical robus...
متن کاملRecoverable robust shortest path problems
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second set...
متن کاملRecoverable Robustness for Train Shunting Problems
Several attempts have been done in the literature in the last years in order to provide a formal definition of the notions of robustness and recoverability for optimization problems. Recently, a new model of recoverable robustness has been introduced in the context of railways optimization. The basic idea of recoverable robustness is to compute solutions that are robust against a limited set of...
متن کامل